Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое anaxiomatization heuristic technique - определение
HEURISTIC THAT NEVER OVERESTIMATES THE COST OF REACHING THE GOAL, I.E. THE COST IT ESTIMATES TO REACH THE GOAL IS NOT HIGHER THAN THE LOWEST POSSIBLE COST FROM THE CURRENT POINT IN THE PATH
Admissible Heuristic; Optimistic heuristic; Inadmissible heuristic
Найдено результатов: 906
Heuristic
PROBLEM-SOLVING METHOD THAT IS SUFFICIENT FOR QUICK, SHORT-TERM SOLUTIONS/APPROXIMATIONS
Heuristics; Hueristic; Heuristo; HEURISTIC; Heurisitc; Heuristically; Huristic; Heuristic Classification; Heuristics in legal decision-making; Formal models of heuristics; Heuristic device; Artificial intelligence heuristics
·adj Serving to discover or find out.
heuristic
PROBLEM-SOLVING METHOD THAT IS SUFFICIENT FOR QUICK, SHORT-TERM SOLUTIONS/APPROXIMATIONS
Heuristics; Hueristic; Heuristo; HEURISTIC; Heurisitc; Heuristically; Huristic; Heuristic Classification; Heuristics in legal decision-making; Formal models of heuristics; Heuristic device; Artificial intelligence heuristics
1.
A heuristic method of learning involves discovery and problem-solving, using reasoning and past experience. (TECHNICAL)
ADJ
2.
A heuristic computer program uses rules based on previous experience in order to solve a problem, rather than using a mathematical procedure. (COMPUTING)
ADJ
see also algorithm
Heuristic
PROBLEM-SOLVING METHOD THAT IS SUFFICIENT FOR QUICK, SHORT-TERM SOLUTIONS/APPROXIMATIONS
Heuristics; Hueristic; Heuristo; HEURISTIC; Heurisitc; Heuristically; Huristic; Heuristic Classification; Heuristics in legal decision-making; Formal models of heuristics; Heuristic device; Artificial intelligence heuristics
A heuristic (; ), or heuristic technique, is any approach to problem solving or self-discovery that employs a practical method that is not guaranteed to be optimal, perfect, or rational, but is nevertheless sufficient for reaching an immediate, short-term goal or approximation. Where finding an optimal solution is impossible or impractical, heuristic methods can be used to speed up the process of finding a satisfactory solution.
heuristic
PROBLEM-SOLVING METHOD THAT IS SUFFICIENT FOR QUICK, SHORT-TERM SOLUTIONS/APPROXIMATIONS
Heuristics; Hueristic; Heuristo; HEURISTIC; Heurisitc; Heuristically; Huristic; Heuristic Classification; Heuristics in legal decision-making; Formal models of heuristics; Heuristic device; Artificial intelligence heuristics
[?hj?(?)'r?st?k]
¦ adjective
1. enabling a person to discover or learn something for themselves.
2. Computing proceeding to a solution by trial and error or by rules that are only loosely defined.
¦ noun a heuristic process or method.
?(heuristics) [usu. treated as sing.] the study and use of heuristic techniques.
Derivatives
heuristically adverb
Origin
C19: formed irregularly from Gk heuriskein 'to find'.
heuristic
PROBLEM-SOLVING METHOD THAT IS SUFFICIENT FOR QUICK, SHORT-TERM SOLUTIONS/APPROXIMATIONS
Heuristics; Hueristic; Heuristo; HEURISTIC; Heurisitc; Heuristically; Huristic; Heuristic Classification; Heuristics in legal decision-making; Formal models of heuristics; Heuristic device; Artificial intelligence heuristics
1. <programming> A rule of thumb, simplification, or educated
guess that reduces or limits the search for solutions in
domains that are difficult and poorly understood. Unlike
algorithms, heuristics do not guarantee optimal, or even
feasible, solutions and are often used with no theoretical
guarantee.
2. <algorithm> approximation algorithm.
(2001-04-12)
heuristics
PROBLEM-SOLVING METHOD THAT IS SUFFICIENT FOR QUICK, SHORT-TERM SOLUTIONS/APPROXIMATIONS
Heuristics; Hueristic; Heuristo; HEURISTIC; Heurisitc; Heuristically; Huristic; Heuristic Classification; Heuristics in legal decision-making; Formal models of heuristics; Heuristic device; Artificial intelligence heuristics
[usu. treated as sing.] the study and use of heuristic techniques.
Musical technique
GROUP OF TECHNIQUES RELATING TO THE COMPOSING, PRODUCTION OR PERFORMANCE OF MUSIC
Technique (music); General Instrumental technique; Performance technique; Instrumental technique; Brass technique; String instrument technique; String technique; Brass instrument technique; Stringed instrument technique; Woodwind technique; Woodwind instrument technique; Percussion technique; Percussion instrument technique; Percussion instrumental technique; Woodwind instrumental technique; Brass instrumental technique; String instrumental technique; Stringed instrumental technique
Musical technique is the ability of instrumental and vocal musicians to exert optimal control of their instruments or vocal cords in order to produce the precise musical effects they desire. Improving one's technique generally entails practicing exercises that improve one's muscular sensitivity and agility.
Heuristic (engineering)
IN ENGINEERING, EXPERIENCE-BASED METHODS USED TO REDUCE THE NEED FOR CALCULATIONS
In engineering, heuristics are experience-based methods used to reduce the need for calculations pertaining to equipment size, performance, or operating conditions. Heuristics are fallible and do not guarantee a correct solution.
Admissible heuristic
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e.
Priority heuristic
Draft:Priority Heuristic; Priority Heuristic
The priority heuristic is a simple, lexicographic decision strategy that correctly predicts classic violations of expected utility theory such as the Allais paradox, the four-fold pattern, the certainty effect, the possibility effect, or intransitivities.Brandstätter, E.
Википедия
Admissible heuristic
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.
It is related to the concept of consistent heuristics. While all consistent heuristics are admissible, not all admissible heuristics are consistent.
